Analysis of Map Reduce Performance using Prefetching Mechanism
نویسندگان
چکیده
منابع مشابه
analysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولCodon Optimization using Map Reduce
Codon Optimization helps increasing immuno-stimulatory nucleotide motifs or decreasing immunesuppresive motifs in DNA expression vectors. This enhances the efficiency of DNA vaccinations. In this paper, we investigate the existing Pattern Matching algorithm for Codon Optimization and try to rewrite the algorithm in MapReduce programming model for execution speed-up and faster computation. Keywo...
متن کاملMap-reduce Implementations: Survey and Performance Comparison
Map Reduce has gained remarkable significance as a prominent parallel data processing tool in the research community, academia and industry with the spurt in volume of data that is to be analyzed. Map Reduce is used in different applications such as data mining, data analytics where massive data analysis is required, but still it is constantly being explored on different parameters such as perf...
متن کاملData Prefetching: A Cost/Performance Analysis
This paper attempts to answer the question, “To what extent is prefetching effective in hiding memory latency, and what is the minimal amount of hardware required to support prefetching?” We begin by providing a classification of the different kinds of prefetching, and reconciling the various common performance metrics to allow fair comparisons. We then put forward an analytical model that give...
متن کاملEnhancing Oblivious RAM Performance Using Dynamic Prefetching
Oblivious RAM (ORAM) is an established technique to hide the access pattern to an untrusted storage system. With ORAM, a curious adversary cannot tell what data address the user is accessing when observing the bits moving between the user and the storage system. All existing ORAM schemes achieve obliviousness by adding redundancy to the storage system, i.e., each access is turned into multiple ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/ijca2015906666